Fast Generalized Sliding Sinusoidal Transforms

Discrete cosine and sine transforms closely approximate the Karhunen–Loeve transform for first-order Markov stationary signals with high low correlation coefficients, respectively. sinusoidal can be used in data compression, digital filtering, spectral analysis pattern recognition. Short-time based on discrete are suitable adaptive processing time–frequency of quasi-stationary data. The generalized sliding is a type short-time transform, that is, fixed-length windowed slides over signal an arbitrary integer step. In this paper, eight fast algorithms calculating various solution second-order linear nonhomogeneous difference equation pruned proposed. performances terms computational complexity execution time were compared those recursive algorithms. proposed resulted significant savings.